package priv.pront.code.mati.province;

import java.util.Scanner;

/**
 * @Description:
 * @Author: pront
 * @Time:2023-11-16 17:17
 */
public class MC0217 {

    static int n;
    static int[] a;

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        n = scanner.nextInt();
        a = new int[n + 1];
        for (int i = 0; i < n; i++) {
            a[i] = scanner.nextInt();
        }

        int left = 0;
        int right = n - 1;
        double lt = 0, rt = 0;

        while (left <= right) {
            if (lt <= rt) {
                lt += a[left] / 2.0;
                left++;
            } else {
                rt += a[right];
                right--;
            }
        }

        System.out.println(left);
    }
}
